Distributed Estimation over Directed Graphs Resilient to Sensor Spoofing

نویسندگان

چکیده

This paper addresses the problem of distributed estimation an unknown dynamic parameter by a multi-agent system over directed communication network in presence adversarial attack on agents' sensors. The mode adversaries is to corrupt sensor measurements some agents, while and information processing capabilities those agents remain unaffected. To ensure that all both normal as well under attack, are able correctly estimate value, Resilient Estimation through Weight Balancing (REWB) algorithm introduced. only condition required for REWB guarantee resilient at any given point time, less than half total number attack. discusses development using concepts weight balancing graphs, consensus+innovations approach linear estimation. Numerical simulations presented illustrate performance our graphs different conditions attacks.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed Mirror Descent over Directed Graphs

In this paper, we propose Distributed Mirror Descent (DMD) algorithm for constrained convex optimization problems on a (strongly-)connected multi-agent network. We assume that each agent has a private objective function and a constraint set. The proposed DMD algorithm employs a locally designed Bregman distance function at each agent, and thus can be viewed as a generalization of the well-known...

متن کامل

Distributed linear estimation over sensor networks

This article may be used for research, teaching and private study purposes. Any substantial or systematic reproduction, redistribution , reselling , loan or sub-licensing, systematic supply or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to da...

متن کامل

On the linear convergence of distributed optimization over directed graphs

This paper develops a fast distributed algorithm, termed DEXTRA, to solve the optimization problem when n agents reach agreement and collaboratively minimize the sum of their local objective functions over the network, where the communication between the agents is described by a directed graph. Existing algorithms solve the problem restricted to directed graphs with convergence rates of O(ln k/...

متن کامل

Maximum Likelihood Estimation Over Directed Acyclic Gaussian Graphs

Estimation of multiple directed graphs becomes challenging in the presence of inhomogeneous data, where directed acyclic graphs (DAGs) are used to represent causal relations among random variables. To infer causal relations among variables, we estimate multiple DAGs given a known ordering in Gaussian graphical models. In particular, we propose a constrained maximum likelihood method with noncon...

متن کامل

State Emulator-based Adaptive Architectures for Resilient Networked Multiagent Systems over Directed and Time-varying Graphs

In this paper, we present adaptive architectures for networked multiagent systems operating over directed networks to achieve resilient coordination in the presence of disturbances. Specifically, we consider a class of unforeseen adverse conditions consisting of persistent exogenous disturbances and present a state emulator-based distributed adaptive control architecture to retrieve the nominal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Control of Network Systems

سال: 2023

ISSN: ['2325-5870', '2372-2533']

DOI: https://doi.org/10.1109/tcns.2023.3247560